A theorem on one-to-one mappings
نویسندگان
چکیده
منابع مشابه
A characterization of one-to-one modular mappings
In this paper we deal with modular mappings as introduced by Lee and Fortes and we build upon their results Our main contribution is a characterization of one to one modular mappings that is valid even when the source domain and the target domain of the transformation have the same size but not the same shape This characterization is constructive and a procedure to test the injectivity of a giv...
متن کاملOne-to-one piecewise linear mappings over triangulations
We call a piecewise linear mapping from a planar triangulation to the plane a convex combination mapping if the image of every interior vertex is a convex combination of the images of its neighbouring vertices. Such mappings satisfy a discrete maximum principle and we show that they are oneto-one if they map the boundary of the triangulation homeomorphically to a convex polygon. This result can...
متن کاملA Theorem on Analytic Strong Multiplicity One
Let K be an algebraic number field, and π = ⊗πv an irreducible, automorphic, cuspidal representation of GLm(AK) with analytic conductor C(π). The theorem on analytic strong multiplicity one established in this note states, essentially, that there exists a positive constant c depending on ε > 0,m, and K only, such that π can be decided completely by its local components πv with norm N(v) < c · C...
متن کاملA Note on Alberti’s Rank–one Theorem
The aim of these notes is to illustrate a proof of the following remarkable Theorem of Alberti (first proved in [1]). Here, when μ is a Radon measure on Ω ⊂ R, we denote by μ its absolutely continuous part (with respect to the Lebesgue measure L ), by μ := μ− μ its singular part, and by |μ| its total variation measure. Clearly, |μ|a = |μa| and |μ|s = μ. When μ = Du for some u ∈ BV (Ω,R), we wil...
متن کاملOne-to-many mappings represented on feed-forward networks
Multiplayer perceptrons or feed-forward networks are generally trained to represent functions or many-to-one (m-o) mappings. This creates a problem if the training data exhibits the property of many-to-many or almost many-many valued-ness because the model, which generated the data, was many-to-many. Therefore in this paper a modified feed-forward network and training algorithm is considered to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1966
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1966.19.253